Solving the orientation-duality problem for a circular feature in motion
نویسندگان
چکیده
Circular features have been commonly used in numerous computer vision application areas for 3-D pose estimation. However, the estimation of such a feature’s pose from 2-D image coordinates results in an orientation-duality problem. Namely, although the 3-D position of the circle’s center can be uniquely identified, the solution process yields two different feasible orientations, of which only one is the true solution. This duality problem is normally addressed through the acquisition of a second image in the case of a “static” feature. This solution, however, would not be applicable to “features in motion”. In this paper, several methods are presented for the solution of the orientationduality problem for circular features that are in motion. The first approach is applicable to those features moving on a 3-D line with constant orientation or to those which are moving on a plane with general motion. The second approach relies on the existence of additional object features, such as points or lines, which are co-planar to the circular
منابع مشابه
An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملRobot Motion Vision Pait I: Theory
A direct method called fixation is introduced for solving the general motion vision problem, arbitrary motion relative to an arbitrary environment. This method results in a linear constraint equation which explicitly expresses the rotational velocity in terms of the translational velocity. The combination of this constraint equation with the Brightness-Change Constraint Equation solves the gene...
متن کاملCompilation and Assessment of a Model for the Correlations between Emotional Self-regulation and Social Problem-solving with Disease Perception and Resilient Mediation in Patients with Multiple Sclerosis in Tabriz, Iran
Objective: The present study aimed to assess the correlations between emotional self-regulation and problem-solving with disease perception through resilient mediation in patients with multiple sclerosis (MS) in Tabriz, Iran. Methodology: This study was carried out as structural equations on 250 MS patients in Tabriz in 2018, who completed emotional self-regulation, problem-solving, disease per...
متن کاملمقایسه میزان توانایی حل مساله- مساله اجتماعی و میزان خطر پذیری در بیماران مبتلا به ایدز و افراد سالم
Background: The present study aimed to compare social problem solving ability and risk-taking in patients with AIDS and healthy individuals. Methods: In the research study, 50 patients aged 20 to 45 years with AIDS referred to Valfajr Health Center Tehran in 2013 were assessed. Also, 50 healthy individuals were considered as the control. To evaluate the ability to solve a social problem, speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Systems, Man, and Cybernetics, Part A
دوره 28 شماره
صفحات -
تاریخ انتشار 1998